O−holes associated with alkali acceptors inBaTiO3

Bottom-Up Tree Acceptors

This paper deals with the formal derivation of an eecient tabulation algorithm for table-driven bottom-up tree acceptors. Bottom-up tree acceptors are based on a notion of match sets. First we derive a naive acceptance algorithm using dynamic computation of match sets. Tabulation of match sets leads to an eecient acceptance algorithm, but tables may be so large that they can not be generated du...

PROPERTIES OF ALKALI-ACTIVATED FLY ASH CONCRETE BLENDED WITH SLAG

Consensus Game Acceptors

We propose a game for recognising formal languages, in which two players with imperfect information need to coordinate on a common decision, given private input information. The players have a joint objective to avoid an inadmissible decision, in spite of the uncertainty induced by the input. We show that this model of consensus acceptor games characterises context-sensitive languages, and conv...

Using Acceptors as Transducers

We wish to use a given nondeterministic two-way multi-tape acceptor as a transducer by supplying the contents for only some of its input tapes, and asking it to generate the missing contents for the other tapes. We provide here an algorithm for assuring beforehand that this transduction always results in a finite set of answers. We also develop an algorithm for evaluating these answers whenever...

Systolic Tree Acceptors

— This paper introduces systolic automata for VLSI as highly concurrent acceptors. Attention is focused on tree automata although other types are also discussed briefly. A number of preliminary results about the capabilities of such automata are obtained. The approach not only opens up a new and interesting area oflanguage theory but also its results give useful hints for VLSI system design par...